Перевод: с английского на русский

с русского на английский

elimination theorem

См. также в других словарях:

  • Cut-elimination theorem — The cut elimination theorem (or Gentzen s Hauptsatz) is the central result establishing the significance of the sequent calculus. It was originally proved by Gerhard Gentzen 1934 in his landmark paper Investigations in Logical Deduction for the… …   Wikipedia

  • Elimination theory — In commutative algebra and algebraic geometry, elimination theory is the classical name for algorithmic approaches to eliminating between polynomials of several variables.The linear case would now routinely be handled by Gaussian elimination,… …   Wikipedia

  • Herbrand's theorem — is a fundamental result of mathematical logic obtained by Jacques Herbrand (1930). [J. Herbrand: Recherches sur la theorie de la demonstration. Travaux de la Societe des Sciences et des Lettres de Varsovie, Class III, Sciences Mathematiques et… …   Wikipedia

  • Dead-end elimination — The dead end elimination algorithm (DEE) is a method for minimizing a function over a discrete set of independent variables. The basic idea is to identify dead ends , i.e., bad combinations of variables that cannot possibly yield the global… …   Wikipedia

  • Cut-elimination — Der Gentzensche Hauptsatz oder Schnittsatz ist ein Satz der mathematischen Logik, der besagt, dass die Schnittregel in Gentzentypkalkülen gültig ist. Er ist nach Gerhard Gentzen benannt, der ihn 1934 aufstellte und bewies. Inhaltsverzeichnis 1… …   Deutsch Wikipedia

  • Automated theorem proving — (ATP) or automated deduction, currently the most well developed subfield of automated reasoning (AR), is the proving of mathematical theorems by a computer program. Decidability of the problem Depending on the underlying logic, the problem of… …   Wikipedia

  • Deduction theorem — In mathematical logic, the deduction theorem is a metatheorem of first order logic.[1] It is a formalization of the common proof technique in which an implication A → B is proved by assuming A and then proving B from this assumption.… …   Wikipedia

  • Model elimination — is the name attached to a pair of proof procedures invented by Donald W. Loveland, the first of which was published in 1968 in the Journal of the ACM. Their primary purpose is to carry out automated theorem proving, though they can readily be… …   Wikipedia

  • Double negative elimination — In propositional logic, the inference rules double negative elimination (also called double negation elimination, double negative introduction, double negation introduction, or simply double negation) allow deriving the double negative equivalent …   Wikipedia

  • Buckingham π theorem — The Buckingham π theorem is a key theorem in dimensional analysis. The theorem loosely states that if we have a physically meaningful equation involving a certain number, n , of physical variables, and these variables are expressible in terms of… …   Wikipedia

  • Quantifier elimination — is a technique in mathematical logic, model theory, and theoretical computer science.We say that a given theory has quantifier elimination if for every sentence with quantification there exists an equivalent (modulo the theory) sentence without… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»